Papers by Lena Katharina Schiffer
Strong Equivalence of TAG and CCG (2021.tacl-1)
Copied to clipboard
| Challenge: | Tree-adjoining grammar and combinatory categorial grammar have the same expressive power on trees. |
| Approach: | Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are well-established grammars with the same expressive power on strings. |
| Outcome: | The proposed grammars have the same expressive power on trees as classical grammars and can express a limited amount of cross-serial dependencies and have the constant growth property. |